On efficient domination for some classes of H-free chordal graphs
نویسندگان
چکیده
منابع مشابه
On Efficient Domination for Some Classes of H-Free Chordal Graphs
A vertex set D in a finite undirected graph G is an efficient dominating set (e.d.s. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient Domination (ED) problem, which asks for the existence of an e.d.s. in G, is known to be NP-complete even for very restricted graph classes such as for 2P3-free chordal graphs while it is solvable in polynomial time for P...
متن کاملEfficient algorithms for Roman domination on some classes of graphs
A Roman dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2} such that every vertex x with f (x) = 0 is adjacent to at least one vertex y with f (y) = 2. The weight of a Roman dominating function is defined to be f (V ) = ∑ x∈V f (x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G. In this paper we first answer ...
متن کاملWeighted Efficient Domination in Classes of P6-free Graphs
In a graph G, an efficient dominating set is a subset D of vertices such that D is an independent set and each vertex outside D has exactly one neighbor in D. The Minimum Weight Efficient Dominating Set (Min-WED) problem asks for an efficient dominating set of total minimum weight in a given vertex-weighted graph; the Maximum Weight Efficient Dominating Set (Max-WED) problem is defined similarl...
متن کاملPolynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs
An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient domination problem is the problem of finding an efficient dominating set of minimum weight in a given vertex-weighted graph; the maximum weight efficient domination problem is defined similarly. We develop a framework...
متن کاملPower domination in some classes of graphs
The problem of monitoring an electric power system by placing as few phase measurement units (PMUs) in the system as possible is closely related to the well-known domination problem in graphs. The power domination number γp(G) is the minimum cardinality of a power dominating set of G. In this paper, we investigate the power domination problem in Mycielskian and generalized Mycielskian of graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2020
ISSN: 0166-218X
DOI: 10.1016/j.dam.2019.04.029